for _ in range(int(input())):
n = int(input())
a = [int(i) for i in input().split()]
ans = "YES"
c = False
for i in range(1, n):
if a[i-1] > a[i] : c = True
elif a[i-1] < a[i] and c : ans = "NO"; break
print(ans)#include <bits/stdc++.h>
using namespace std;
int main(){
int t;
cin>>t;
while(t--){
int n;
cin>>n;
int a[n+1];
int l=1,r=n;
for(int i=1;i<=n;i++){
cin>>a[i];
}
while(l<n && a[l]<=a[l+1]){
l++;
}
while(r>1 && a[r]<=a[r-1]){
r--;
}
if(r<=l) cout<<"YES"<<endl;
else cout<<"NO"<<endl;
}
return 0;
}1632B - Roof Construction | 388A - Fox and Box Accumulation |
451A - Game With Sticks | 768A - Oath of the Night's Watch |
156C - Cipher | 545D - Queue |
459B - Pashmak and Flowers | 1538A - Stone Game |
1454C - Sequence Transformation | 165B - Burning Midnight Oil |
17A - Noldbach problem | 1350A - Orac and Factors |
1373A - Donut Shops | 26A - Almost Prime |
1656E - Equal Tree Sums | 1656B - Subtract Operation |
1656A - Good Pairs | 1367A - Short Substrings |
87A - Trains | 664A - Complicated GCD |
1635D - Infinite Set | 1462A - Favorite Sequence |
1445B - Elimination | 1656C - Make Equal With Mod |
567A - Lineland Mail | 1553A - Digits Sum |
1359B - New Theatre Square | 766A - Mahmoud and Longest Uncommon Subsequence |
701B - Cells Not Under Attack | 702A - Maximum Increase |